n=int(input())
l=input().split()
l1=[int(num) for num in l]
l1.sort()
a,b=0,0
if len(l1)==1:print(-1)
else:
a+=l1[0]
b+=sum(l1[1:])
if a==b:print(-1)
else:
print(1)
print(str(l.index(str(a))+1))
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int A[n];
for(int i = 0 ; i < n ; i++){
cin>>A[i];
}
if((n==0)||(n==1)||(A[0] == A[n-1] && n == 2)){
cout<<"-1"<<endl;
}
else{
int min=INT_MAX;
int index=-1;
cout<<1<<endl;
for(int i = 0 ; i<n ; i++){
if(A[i]<min){
min=A[i];
index=i;
}
}
cout<<index+1;
}
}416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |
1630A - And Matching | 1630B - Range and Partition |